Communicating Finite-State Machines and Two-Variable Logic
نویسندگان
چکیده
Communicating finite-state machines are a fundamental, well-studied model of finite-state processes that communicate via unbounded first-in first-out channels. We show that they are expressively equivalent to existential MSO logic with two first-order variables and the order relation.
منابع مشابه
Self-Timed Architecture of a Reduced Instruction Set Computer
An advanced Self-Timed Reduced Instruction Set Computer (ST-RISC) architecture is described. It is designed hierarchically, and is formally specified functionally at the various levels by a CSP-like language. The architectural features include decoupled data and branch processors, delayed branches with variable delay, unified data path and control, efficient non-redundant handshaking protocols,...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملSubstructural Proofs as Automata
We present subsingleton logic as a very small fragment of linear logic containing only , 1, least fixed points and allowing circular proofs. We show that cut-free proofs in this logic are in a Curry– Howard correspondence with subsequential finite state transducers. Constructions on finite state automata and transducers such as composition, complement, and inverse homomorphism can then be reali...
متن کاملOn the fly model checking of communicating UML State Machines1
In this paper we present an ``on the fly'' model checker for the verification of the dynamic behavior of UML models seen as a set of communicating state machines. The logic supported by the tool is an extension of the action based branching time temporal logic μ-ACTL and has the power of full μ-calculus. Early results on the application of this model checker to a case study have been also repor...
متن کاملRegisterwait Faultservice Ready Idle ? Req ! Alarm ! Done ? Ack ? Alarm ! Ack ? Done ! Req
Brand and Zaaropulo BZ83] introduced the model of communicating nite-state machines to represent a distributed system connected with FIFO channels. Several diierent communication protocols can be speciied with this simple model. In this paper we address the problem of automatically validating protocols by verifying properties such as well-formedness and absence of deadlock. Our method is based ...
متن کامل